Random Boolean Networks and Evolutionary Game Theory

Recent years have seen increased interest in the question of whether it is possible to provide an evolutionary game theoretic explanation for certain kinds of social norms. I sketch a proof of a general representation theorem for a large class of evolutionary game theoretic models played on a social network, in hope that this will contribute to a greater understanding of the long-term evolutionary dynamics of such models, and hence the evolution of social norms. More precisely, I show how many kinds of social networks can be translated into random boolean networks. The interesting and useful part of this result consists of the demonstration that, for many social networks, there is a bijection